Deployment of the meta heuristic Colonial Competitive Algorithm in synthesis of unequally spaced linear antenna array
نویسندگان
چکیده
In this paper we re-call a recently developed meta heuristic optimization algorithm based on socio-political process of imperialistic competition. This Colonial Competitive Algorithm (CCA) has shown its efficient capability in comparison to convenient optimization algorithms like GA, PSO. In this study we investigate the synthesis problem of unequally linear space antenna using CCA and show the efficient convergence to obtain a pattern with acceptable Side Lobe Level.
منابع مشابه
Digitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms
This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...
متن کاملA Thinning Method of Linear And Planar Array Antennas To Reduce SLL of Radiation Pattern By GWO And ICA Algorithms
In the recent years, the optimization techniques using evolutionary algorithms have been widely used to solve electromagnetic problems. These algorithms use thinning the antenna arrays with the aim of reducing the complexity and thus achieving the optimal solution and decreasing the side lobe level. To obtain the optimal solution, thinning is performed by removing some elements in an array thro...
متن کاملDevelopment a New Technique Based on Least Square Method to Synthesize the Pattern of Equally Space Linear Arrays
Using the sampled data of a desired pattern is a common technique in pattern synthesizing of array factor (AF) of antenna arrays. Based on the obtained data matrix, Least Square Method (LSM) is used to calculate the exciting coefficient of array elements. The most important parameter, which involves the accuracy and complexity of calculation, is the sampling rate of the desired pattern. Classic...
متن کاملApplication of Chaotic Particle Swarm Opti- Mization Algorithm to Pattern Synthesis of Antenna Arrays
To deal with pattern synthesis of antenna arrays, a chaotic particle swarm optimization (CPSO) is presented to avoid the premature convergence. By fusing with the ergodic and stochastic chaos, the novel algorithm explores the global optimum with the comprehensive learning strategy. The chaotic searching region can be adjusted adaptively. To evaluate the performance of CPSO, several representati...
متن کاملAn imperialist competitive algorithm for solving the production scheduling problem in open pit mine
Production scheduling (planning) of an open-pit mine is the procedure during which the rock blocks are assigned to different production periods in a way that the highest net present value of the project achieved subject to operational constraints. The paper introduces a new and computationally less expensive meta-heuristic technique known as imperialist competitive algorithm (ICA) for long-term...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Electronic Express
دوره 8 شماره
صفحات -
تاریخ انتشار 2011